The DIAMOND System for Argumentation: Preliminary Report
نویسندگان
چکیده
Abstract dialectical frameworks (ADFs) are a powerful generalisation of Dung’s abstract argumentation frameworks. In this paper we present an answer set programming based software system, called DIAMOND (DIAlectical MOdels eNcoDing). It translates ADFs into answer set programs whose stable models correspond to models of the ADF with respect to several semantics (i.e. admissible, complete, stable, grounded).
منابع مشابه
DIAMOND : A System for Computing with
This paper briefly describes the DIAMOND system, version 2.0.0, in its role as submission to the First International Competition on Computational Models of Argumentation (ICCMA). DIAMOND is essentially a collection of answer set programming (ASP) encodings of semantics of abstract dialectical frameworks (ADFs) together with a wrapper script that calls an ASP solver with adequate encodings for a...
متن کاملReaching agreements through argumentation: (Preliminary Report)*
In a multi-agent environment, where selfmotivated (selfish) agents try to pursue their own goals, cooperation can not be taken for granted. Cooperation must be planned for and achieved through communication and negotiation. We look at argumentation as a mechanism for achieving cooperation and agreement. Using categories identified from human multiagent negotiation, we present a basis for an axi...
متن کاملDialectical Proof Theory for Defeasible Argumentation with Defeasible Priorities (Preliminary Report)
In this paper a dialectical proof theory is proposed for logical systems for defeasible argumentation that t a certain format. This format is the abstract theory developed by Dung, Kowalski and others. A main feature of the proof theory is that it also applies to systems in which reasoning about the standards for comparing arguments is possible. The proof theory could serve as thèlogical core' ...
متن کاملArgumentation with Defeasible Conditionals: a Preliminary Report (extended Abstract)
This paper investigates the relation between logics for defeasible conditionals and systems for defeasible argumentation. Starting from the assumption that the construction of arguments and the comparison of incompatible arguments are independent phenomena, it is argued that connict resolution plays a role not only in reasoning with, but also in reasoning about defaults. Since in the latter pha...
متن کاملTransfer of semantics from argumentation frameworks to logic programming A preliminary report
There are various interesting semantics’ (extensions) designed for argumentation frameworks. They enable to assign a meaning, e.g., to odd-length cycles. Our main motivation is to transfer semantics’ proposed by Baroni, Giacomin and Guida for argumentation frameworks with odd-length cycles to logic programs with odd-length cycles through default negation. The developed construction is even stro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1312.6140 شماره
صفحات -
تاریخ انتشار 2013